Conical averagedness and convergence analysis of fixed point algorithms

نویسندگان

چکیده

We study a conical extension of averaged nonexpansive operators and the role it plays in convergence analysis fixed point algorithms. Various properties conically are systematically investigated, particular, stability under relaxations, convex combinations compositions. derive averagedness resolvents generalized monotone operators. These then utilized order to analyze proximal algorithm, forward–backward adaptive Douglas–Rachford algorithm. Our unifies, improves casts new light on recent studies these topics.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convergence of fixed point continuation algorithms for matrix rank minimization

The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding, etc. As this problem is NP-hard in general, its convex relaxation, the nuclear norm minimization problem, is often solved instead. Recently, Ma, Goldfarb and Chen proposed a fixed-point continuation algorithm for solving the nuclear norm minimization pr...

متن کامل

Monotonic convergence of fixed-point algorithms for ICA

We re-examine a fixed-point algorithm proposed by Hyvarinen for independent component analysis, wherein local convergence is proved subject to an ideal signal model using a square invertible mixing matrix. Here, we derive step-size bounds which ensure monotonic convergence to a local extremum for any initial condition. Our analysis does not assume an ideal signal model but appeals rather to pro...

متن کامل

A strong convergence theorem for solutions of zero point problems and fixed point problems

Zero point problems of the sum of two monotone mappings and fixed point problems of a strictly pseudocontractive mapping are investigated‎. ‎A strong convergence theorem for the common solutions of the problems is established in the framework of Hilbert spaces‎.

متن کامل

Fast and robust fixed-point algorithms for independent component analysis

Independent component analysis (ICA) is a statistical method for transforming an observed multidimensional random vector into components that are statistically as independent from each other as possible. In this paper, we use a combination of two different approaches for linear ICA: Comon's information-theoretic approach and the projection pursuit approach. Using maximum entropy approximations ...

متن کامل

Applications of Fixed Point and Approximate Algorithms

As very powerful and important tools in the study of nonlinear sciences, fixed point methods have attracted so much attention. Over the last decades, fixed point techniques have been applied extensively in such diverse fields as biology, chemistry, economics, engineering, game theory, physics, and so on. The thorough study of the fixed point theory and its approach methods contained in the lite...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Global Optimization

سال: 2021

ISSN: ['1573-2916', '0925-5001']

DOI: https://doi.org/10.1007/s10898-021-01057-4